Convex Regions on the n-Dimensional Spherical Surface
نویسندگان
چکیده
منابع مشابه
On Computing the Convex Hull of (Piecewise) Spherical Objects
We utilize support functions to transform the problem of constructing the convex hull of a finite set of spherical objects into the problem of computing the upper envelope of piecewise linear functions. This approach is particularly suited if the objects are (possibly intersecting) circular arcs in the plane or spheres in three-space.
متن کاملSurface critical exponents for a three-dimensional modified spherical model
A modified three-dimensional mean spherical model with a L-layer film geometry under Neumann-Neumann boundary conditions is considered. Two spherical fields are present in the model: a surface one fixes the mean square value of the spins at the boundaries at some ρ > 0, and a bulk one imposes the standard spherical constraint (the mean square value of the spins in the bulk equals one). The surf...
متن کاملConvex Approximation by Spherical Patches
Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subs...
متن کاملApproximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spherical approximation, while an efficient, globally optimal solution for the ellipsoidal problem is proposed in terms of semidefinite programming (SDP). In addition, the paper presents a result for robust fitting in pres...
متن کاملOn optimal bridges between two convex regions
Given k disjoint regions in the plane or space, the bridge problem asks for k − 1 line segments (optimal bridges) which connect these regions so as to minimize the length of the longest path between two points in the final connected region. We present O(n) and O(n2) time algorithms for finding an optimal bridge between two convex regions in the plane and space, respectively. An important proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematics
سال: 1946
ISSN: 0003-486X
DOI: 10.2307/1969084